MDL-Based Context-Free Graph Grammar Induction
نویسندگان
چکیده
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biased toward grammars that minimize description length. Grammar features include recursion, variables and relationships. We present an illustrative example, demonstrate the algorithms ability to learn in the presence of noise, and show real-world examples.
منابع مشابه
Mdl-based context-free graph grammar induction and applications
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biased toward grammars that minimize description length. Grammar features include recursion, variables and relationships. We present an illustrative example, demonstrate the algorithm’s ability to learn in the presence of n...
متن کاملLearning the Grammar of Human Activity from Video
Stochastic Context-Free Grammars (SCFG) have been shown to be useful for applications beyond natural language analysis, specifically vision-based human activity analysis. Vision-based symbol strings differ from natural language strings, in that a string of symbols produced by video often times contains noise symbols, making grammatical inference very difficult. In order to obtain reliable resul...
متن کاملUnsupervised Grammar Inference Using the Minimum Description Length Principle
Context Free Grammars (CFGs) are widely used in programming language descriptions, natural language processing, compilers, and other areas of software engineering where there is a need for describing the syntactic structures of programs. Grammar inference (GI) is the induction of CFGs from sample programs and is a challenging problem. We describe an unsupervised GI approach which uses simplicit...
متن کاملAn MDL Approach to Learning Activity Grammars
Stochastic Context-Free Grammars (SCFG) have been shown to be useful for vision-based human activity analysis. However, action strings from vision-based systems differ from word strings, in that a string of symbols produced by video contains noise symbols, making grammar learning very difficult. In order to learn the basic structure of human activities, it is necessary to filter out these noise...
متن کاملRecovering the Basic Structure of Human Activities from Noisy Video-Based Symbol Strings
In recent years stochastic context-free grammars have been shown to be effective in modeling human activities because of the hierarchical structures they represent. However, most of the research in this area has yet to address the issue of learning the activity grammars from a noisy input source, namely, video. In this paper, we present a framework for identifying noise and recovering the basic...
متن کامل